A New Foundation of Attribute Grammars in Traced Symmetric Monoidal Categories
نویسنده
چکیده
In this paper we propose a new categorical formulation of attribute grammars in traced symmetric monoidal categories. The new formulation, called monoidal attribute grammars, concisely captures the essence of the classical attribute grammars. We study monoidal attribute grammars in two categories: Rel and ωCPPO. It turns out that in Rel monoidal attribute grammars correspond to the graphtheoretic representation of attribute dependencies, while in ωCPPO monoidal attribute grammars are equivalent to Chirica and Martin’s K-systems. We also show that in traced symmetric monoidal closed categories every monoidal attribute grammar is equivalent to the one which does not use inherited attributes.
منابع مشابه
Attribute Grammars and Categorical Semantics
We give a new formulation of attribute grammars (AG for short) called monoidal AGs in traced symmetric monoidal categories. Monoidal AGs subsume existing domain-theoretic, graph-theoretic and relational formulations of AGs. Using a 2-categorical aspect of monoidal AGs, we also show that every monoidal AG is equivalent to a synthesised one when the underlying category is closed, and that there i...
متن کاملCategorical Descriptional Composition
Descriptional composition is a method to fuse two term transformation algorithms described by attribute couplings (AC, attribute grammars over terms) into one. In this article, we provide a general categorical framework for the descriptional composition based on traced symmetric monoidal categories and the Int construction by Joyal et al. We demonstrate that this framework can handle the descri...
متن کاملThe symmetric monoidal closed category of cpo $M$-sets
In this paper, we show that the category of directed complete posets with bottom elements (cpos) endowed with an action of a monoid $M$ on them forms a monoidal category. It is also proved that this category is symmetric closed.
متن کاملTraced monoidal categories BY ANDRE JOYAL
This paper introduces axioms for an abstract trace on a monoidal category. This trace can be interpreted in various contexts where it could alternatively be called contraction, feedback, Markov trace or braid closure. Each full submonoidal category of a tortile (or ribbon) monoidal category admits a canonical trace. We prove the structure theorem that every traced monoidal category arises in th...
متن کاملHoare Logic in the Abstract
We present an abstraction of Hoare logic to traced symmetric monoidal categories, a very general framework for the theory of systems. We first identify a particular class of functors – which we call ‘verification functors’ – between traced symmetric monoidal categories and subcategories of Preord (the category of preordered sets and monotone mappings). We then give an abstract definition of Hoa...
متن کامل